Symbolic Deduction in Mathematical Databases based on Properties
نویسنده
چکیده
We claim that mathematical databases should be more than a collection of domains with associated theorems; in particular theorems should be stated as general as possible, that is independent of domains. A database then should be able to check whether such a general theorem holds in a particular domain. To this end we use a properties-based representation for both theorems and domains, and present a deduction calculus that using additional rules about the problem domain allows to perform such a theorem check.
منابع مشابه
Deduction versus Computation: The Case of Induction
The fundamental difference and the essential complementarity between computation and deduction are central in computer algebra, automated deduction, proof assistants and in frameworks making them cooperating. In this work we show that the fundamental proof method of induction can be understood and implemented as either computation or deduction. Inductive proofs can be built either explicitly by...
متن کاملSpatial Reasoning Using Symbolic Arrays
In this paper we have proposed the use of multi-level knowledge representation techniques for Geographic Information Systems. We believe that adopting different levels of representations can significantly improve the functionality and efficiency of a system. Although we have presented symbolic arrays as a medium for organising spatial knowledge, this is by no means the only way for structuring ...
متن کاملSpatial Reasoning Using Symbolic Arrays
In this paper we have proposed the use of multi-level knowledge representation techniques for Geographic Information Systems. We believe that adopting different levels of representations can significantly improve the functionality and efficiency of a system. Although we have presented symbolic arrays as a medium for organising spatial knowledge, this is by no means the only way for structuring ...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملFormalising Observer Theory for Environment-Sensitive Bisimulation
We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the knowledge and capabilities of an observer, and can be given a formal account using deductive systems, such as those used in various “environment-sensitive” bisimulation for process calculi, e.g., the spi-calculus. Two notions are ...
متن کامل